The nonisolating degrees are nowhere dense in the computably enumerable degrees

نویسندگان

  • Douglas Cenzer
  • Geoffrey LaForte
  • Guohua Wu
چکیده

The d.c.e. degrees were first studied by Cooper [5] and Lachlan who showed that there is a proper d.c.e degree, a d.c.e. degree containing no c.e. sets, and that every nonzero d.c.e. degree bounds a nonzero c.e. degree, respectively. The main motivation of research on the d.c.e. degrees is to study the differences between the structures of d.c.e. degrees and Δ2 degrees, and between the structures of d.c.e. degrees and c.e. degrees. Lachlan’s observation mentioned above shows that downwards density holds in the d.c.e. degrees. Hence, as Jockusch noticed, the d.c.e. degrees are not comple∗Cenzer is partially supported by National Science Foundation grants DMS 0532644 and 0554841. †Wu is partially supported by an AcRF research grant No. RG58/06 from MOE of Singapore.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees

The existence of isolated degrees was proved by Cooper and Yi in 1995 in [6], where a d.c.e. degree d is isolated by a c.e. degree a if a < d is the greatest c.e. degree below d. A computably enumerable degree c is non-isolating if no d.c.e. degree above c is isolated by c. Obviously, 0 is a non-isolating degree. Cooper and Yi asked in [6] whether there is a nonzero non-isolating degree. Arslan...

متن کامل

The ibT degrees of computably enumerable sets are not dense

We show that the identity bounded Turing degrees of computably enumerable sets are not dense.

متن کامل

The computable Lipschitz degrees of computably enumerable sets are not dense

The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both the relative randomness and the relative computational power of real numbers. This paper proves that the computable Lipschitz degrees of computably enumerable sets are not dense. An immediate corollary is that the Solo...

متن کامل

Upper bounds on ideals in the computably enumerable Turing degrees

We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows that there is no Σ0 4 prime ideal in the c.e. Turing degrees. This answers a question of Calhoun (1993) [2]. Every properΣ0 3 ideal in the c.e. Turing degrees has a low2 upper bound. Furthermore, the partial order of Σ0...

متن کامل

Universal computably enumerable sets and initial segment prefix-free complexity

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set A with non-trivial prefixfree initial segment complexity, there exists a Turing complete computably enumerable set B with complexity strictly less than the complexity of A. On the other hand it is known that s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008